The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.)
نویسندگان
چکیده
Consider a set of N objects, consisting of Ni objects originating from population Ai, i = 1,. . . , k, so that N = Zf-, Ni. In order to classify the set of N objects, we measure a variable with pdf A for objects originating from population Ai. Let x1,x2;. .,x, be the measured values of the N objects, which are assumed to be independent. Now consider the N-tuple Gi = (gljt g2j, * * ’ 3 Sp ’ ’ ’ , gNj), indicating that the object with measured value xi originates from population A,, with gU E { 1,2,* * f ,k} for i= 1,2,* * a, N. The number of elements in Gj with value I is equal to N, (I = $2, + . . , k). A possible classification of the set of N objects can be represented by the N-tuple C=(C*,C~;~~ ,ci; . * , cN), where ci E { 1,2,. . . , k}, indicating that the object with measured value xi is allocated to class ci (there is no restriction on the number of elements in C with a specific value). We find for the mean number of misallocations, given the measured values x,, x2,. . . ,x,, according to C
منابع مشابه
Edge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملNeighborhood size selection in the k-nearest-neighbor rule using statistical confidence
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this work, we propose a new method for neighborhood size selection that is based on the concept of statistical confidence. We define the confidence associated with a decision that is made by the majority rule from a finite num...
متن کاملDetection of some Tree Species from Terrestrial Laser Scanner Point Cloud Data Using Support-vector Machine and Nearest Neighborhood Algorithms
acquisition field reference data using conventional methods due to limited and time-consuming data from a single tree in recent years, to generate reference data for forest studies using terrestrial laser scanner data, aerial laser scanner data, radar and Optics has become commonplace, and complete, accurate 3D data from a single tree or reference trees can be recorded. The detection and identi...
متن کاملAn upper bound on prototype set size for condensed nearest neighbor
The condensed nearest neighbor (CNN) algorithm is a heuristic for reducing the number of prototypical points stored by a nearest neighbor classifier, while keeping the classification rule given by the reduced prototypical set consistent with the full set. I present an upper bound on the number of prototypical points accumulated by CNN. The bound originates in a bound on the number of times the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 25 شماره
صفحات -
تاریخ انتشار 1979